Towards a platform for linearization grammars
نویسندگان
چکیده
A number of authors working in the HPSG paradigm (Reape, 1990, 1994, 1996; Richter and Sailer, 1995; Kathol, 1995; Müller, 1995, 1999a; Penn, 1999, and others) have argued on linguistic grounds that constituent structure should not be directly linked to word order properties. While the formal realizations of the proposals differ, all these so-called linearization approaches have in common that they allow constituents to be discontinuous, i.e., they do not cover a continuous stretch of phonological or graphemic material.1 On the computational side, some algorithms for parsing grammars licensing such discontinuous constituents have been proposed (Johnson, 1985; Reape, 1991; van Noord, 1991). A computational encoding of an HPSG linearization grammar for German is discussed in Müller (1996). The BABEL system described implements the HPSG linearization theory of Müller (1999a) in Prolog and uses a basic parser for discontinuous constituents for processing with this grammar.
منابع مشابه
GIDLP: A Grammar Format For Linearization-based HPSG
Linearization-based HPSG theories are widely used for analyzing languages with relatively free constituent order. This paper introduces the Generalized ID/LP (GIDLP) grammar format, which supports a direct encoding of such theories, and discusses key aspects of a parser that makes use of the dominance, precedence, and linearization domain information explicitly encoded in this grammar format. W...
متن کاملA Grammar Formalism and Parser for Linearization-based HPSG
Linearization-based HPSG theories are widely used for analyzing languages with relatively free constituent order. This paper introduces the Generalized ID/LP (GIDLP) grammar format, which supports a direct encoding of such theories, and discusses key aspects of a parser that makes use of the dominance, precedence, and linearization domain information explicitly encoded in this grammar format. W...
متن کاملOxygen: A Language Independent Linearization Engine
This paper describes a language independent linearization engine, oxyGen. This system compiles target language grammars into programs that take feature graphs as inputs and generate word lattices that can be passed along to the statistical extraction module of the generation system Nitrogen. The grammars are written using a flexible and powerful language, oxyL, that has the power of a programmi...
متن کاملSentence Realization with Unlexicalized Tree Linearization Grammars
Sentence realization, as one of the important components in natural language generation, has taken a statistical swing in recent years. While most previous approaches make heavy usage of lexical information in terms of N -gram language models, we propose a novel method based on unlexicalized tree linearization grammars. We formally define the grammar representation and demonstrate learning from...
متن کاملOxygen: A Language Independent Linerization Engine
This paper describes a language independent linearization engine, oxyGen. This system compiles target language grammars into programs that take feature graphs as inputs and generate word lattices that can be passed along to the statistical extraction module of the generation system Nitrogen. The grammars are written using a flexible and powerful language, oxyL, that has the power of a programmi...
متن کامل